A new robust circular Gabor based object matching by using weighted Hausdorff distance
نویسندگان
چکیده
This paper describes a new and efficient circular Gabor filter-based method for object matching by using a version of weighted modified Hausdorff distance. An improved Gabor odd filter-based edge detector is performed to get edge maps. A rotation invariant circular Gabor-based filter, which is different from conventional Gabor filter, is used to extract rotation invariant features. The Hausdorff distance (HD) has been shown an effective measure for determining the degree of resemblance between binary images. A version of weighted modified Hausdorff distance (WMHD) in the circular Gabor feature space is introduced to determine which position can be possible object model location, which we call coarse location, and at the same time we get correspondence pairs of edge pixels for both object model and input test image. Then we introduce the geometric shape information derived from the above correspondence pairs of edge pixels to find the fine location. The experimental results given in this paper show the proposed algorithm is robust to rotation, scale, occlusion, and noise etc. 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Object Recognition through Template Matching Using an Adaptive and Robust Hausdorff Distance
In computer vision, the partial Hausdorff distances (PHDs) are used to compare images but with strong limitations of using fixed fractions. In this paper, we formulate an adaptive and robust Hausdorff distance (ARHD) with nonparametric and robust statistical methods. The new distance is estimated using the empirical distribution of the distance variable based on the distance map of the template...
متن کاملObject matching algorithms using robust Hausdorff distance measures
A Hausdorff distance (HD) is one of commonly used measures for object matching. This work analyzes the conventional HD measures and proposes two robust HD measures based on m-estimation and least trimmed square (LTS) which are more efficient than the conventional HD measures. By computer simulation, the matching performance of the conventional and proposed HD measures is compared with synthetic...
متن کاملImage retrieval by information fusion based on scalable vocabulary tree and robust Hausdorff distance
In recent years, Scalable Vocabulary Tree (SVT) has been shown to be effective in image retrieval. However, for general images where the foreground is the object to be recognized while the background is cluttered, the performance of the current SVT framework is restricted. In this paper, a new image retrieval framework that incorporates a robust distance metric and information fusion is propose...
متن کاملNew Robust Descriptor for Image Matching
Nowadays, object recognition based on feature extraction is widely used in image matching due to its robustness to different types of image transformations. This paper introduces a new approach for extracting invariant features from interest regions. This approach is inspired from the well known Scale Invariant Feature Transform (SIFT) interest points detector and aims to improve the computatio...
متن کاملRobust Hausdorff distance matching algorithms using pyramidal structures
This paper proposes two Hausdor! distance (HD) matching algorithms, in which robust HD measures are implemented in pyramidal structures. By computer simulations, the matching performance of the conventional HD measures and the proposed robust HD matching algorithms using pyramidal structures is compared, with real images which are degraded by noise and occlusions. 2001 Pattern Recognition Socie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition Letters
دوره 25 شماره
صفحات -
تاریخ انتشار 2004